Solving Assembly Line Balancing Problems by Combining IP and CP

Assembly line balancing problems consist in partitioning the work necessary to assemble a number of products among different stations of an assembly line. We present a hybrid approach for solving such problems, which combines constraint programming and integer programming.Comment: 10 pages, Sixth Annual Workshop of the ERCIM Working Group on Constraints, Prague, June 200

Dynamic optimization of metabolic networks coupled with gene expression

The regulation of metabolic activity by tuning enzyme expression levels is crucial to sustain cellular growth in changing environments. Metabolic networks are often studied at steady state using constraint-based models and optimization techniques. However, metabolic adaptations driven by changes in gene expression cannot be analyzed by steady state models, as these do not account for temporal changes in biomass composition. Here we present a dynamic optimization framework that integrates the metabolic network with the dynamics of biomass production and composition, explicitly taking into account enzyme production costs and enzymatic capacity. In contrast to the established dynamic flux balance analysis, our approach allows predicting dynamic changes in both the metabolic fluxes and the biomass composition during metabolic adaptations. We applied our algorithm in two case studies: a minimal nutrient uptake network, and an abstraction of core metabolic processes in bacteria. In the minimal model, we show that the optimized uptake rates reproduce the empirical Monod growth for bacterial cultures. For the network of core metabolic processes, the dynamic optimization algorithm predicted commonly observed metabolic adaptations, such as a diauxic switch with a preference ranking for different nutrients, re-utilization of waste products after depletion of the original substrate, and metabolic adaptation to an impending nutrient depletion. These examples illustrate how dynamic adaptations of enzyme expression can be predicted solely from an optimization principle

A mixed-integer linear programming approach to the reduction of genome-scale metabolic networks

Constraint-based analysis has become a widely used method to study metabolic networks. While some of the associated algorithms can be applied to genome- scale network reconstructions with several thousands of reactions, others are limited to small or medium-sized models. In 2015, Erdrich et al. introduced a method called NetworkReducer, which reduces large metabolic networks to smaller subnetworks, while preserving a set of biological requirements that can be specified by the user. Already in 2001, Burgard et al. developed a mixed-integer linear programming (MILP) approach for computing minimal reaction sets under a given growth requirement

Double and multiple knockout simulations for genome-scale metabolic network reconstructions

Constraint-based modeling of genome-scale metabolic network reconstructions has become a widely used approach in computational biology. Flux coupling analysis is a constraint-based method that analyses the impact of single reaction knockouts on other reactions in the network. We present an extension of flux coupling analysis for double and multiple gene or reaction knockouts, and develop corresponding algorithms for an in silico simulation. To evaluate our method, we perform a full single and double knockout analysis on a selection of genome-scale metabolic network reconstructions and compare the results

On the geometry of elementary flux modes

Elementary flux modes (EFMs) play a prominent role in the constraint-based analysis of metabolic networks. They correspond to minimal functional units of the metabolic network at steady-state and as such have been studied for almost 30 years. The set of all EFMs in a metabolic network tends to be very large and may have exponential size in the number of reactions. Hence, there is a need to elucidate the structure of this set. Here we focus on geometric properties of EFMs. We analyze the distribution of EFMs in the face lattice of the steady-state flux cone of the metabolic network and show that EFMs in the relative interior of the cone occur only in very special cases. We introduce the concept of degree of an EFM as a measure how elementary it is and study the decomposition of flux vectors and EFMs depending on their degree. Geometric analysis can help to better understand the structure of the set of EFMs, which is important from both the mathematical and the biological viewpoint

Elucidating temporal resource allocation and diurnal dynamics in phototrophic metabolism using conditional FBA

The computational analysis of phototrophic growth using constraint-based optimization requires to go beyond current time-invariant implementations of flux-balance analysis (FBA). Phototrophic organisms, such as cyanobacteria, rely on harvesting the sun’s energy for the conversion of atmospheric CO2 into organic carbon, hence their metabolism follows a strongly diurnal lifestyle. We describe the growth of cyanobacteria in a periodic environment using a new method called conditional FBA. Our approach enables us to incorporate the temporal organization and conditional dependencies into a constraint-based description of phototrophic metabolism. Specifically, we take into account that cellular processes require resources that are themselves products of metabolism. Phototrophic growth can therefore be formulated as a time- dependent linear optimization problem, such that optimal growth requires a differential allocation of resources during different times of the day. Conditional FBA then allows us to simulate phototrophic growth of an average cell in an environment with varying light intensity, resulting in dynamic time-courses for all involved reaction fluxes, as well as changes in biomass composition over a diurnal cycle. Our results are in good agreement with several known facts about the temporal organization of phototrophic growth and have implications for further analysis of resource allocation problems in phototrophic metabolism

Time-Optimal Adaptation in Metabolic Network Models

Analysis of metabolic models using constraint-based optimization has emerged as an important computational technique to elucidate and eventually predict cellular metabolism and growth. In this work, we introduce time-optimal adaptation (TOA), a new constraint-based modeling approach that allows us to evaluate the fastest possible adaptation to a pre-defined cellular state while fulfilling a given set of dynamic and static constraints. TOA falls into the mathematical problem class of time-optimal control problems, and, in its general form, can be broadly applied and thereby extends most existing constraint-based modeling frameworks. Specifically, we introduce a general mathematical framework that captures many existing constraint-based methods and define TOA within this framework. We then exemplify TOA using a coarse-grained self-replicator model and demonstrate that TOA allows us to explain several well-known experimental phenomena that are difficult to explore using existing constraint-based analysis methods. We show that TOA predicts accumulation of storage compounds in constant environments, as well as overshoot uptake metabolism after periods of nutrient scarcity. TOA shows that organisms with internal temporal degrees of freedom, such as storage, can in most environments outperform organisms with a static intracellular composition. Furthermore, TOA reveals that organisms adapted to better growth conditions than present in the environment (“optimists”) typically outperform organisms adapted to poorer growth conditions (“pessimists”).Peer Reviewe